An Approximation Scheme for Data Monetization

نویسندگان

چکیده

The unprecedented rate at which data is being generated has led to the growth of markets where valuable datasets are bought and sold. A salient feature this market that a data-buyer (agent) endowed with multi-dimensional private information, namely her ``ideal'' record she values most how valuation for given changes as its distance from ideal changes. Consequently, revenue-maximization problem faced by data-seller (principal), who serves multiple buyers, mechanism-design problem, well-recognized difficult solve. Our main result in paper an approximation scheme guarantees revenue within close positive amount optimal desired. generates posted-price menu consisting set item-price pairs -- each entry consists item, i.e., records dataset, price corresponding item. As tradeoff, length resulting increases desired guarantee gets closer zero. For convenience practice, data-sellers may want ability limit used scheme. To facilitate this, we extend our analysis obtain general any length. We also demonstrate seller can exploit buyers' preferences generate intuitive useful rules thumb effective practical implementation

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resilient Big Data Monetization

Big Data Monetization is resembled by the domination of service provider’s measurement tools over Smart-device user’s common-interests (e.g. environmental information, emo-tion, etc.). However, adaptation to usage-dynamics necessitates stronger binding between common-interests and measurementtools. Hence, Resilient Big Data monetization is devised as kdominance and m-connectivity problems, such...

متن کامل

An Efficient Approximation Scheme for Data Mining Tasks

We investigate the use of biased sampling according to the density of the dataset, to speed up the operation of general data mining tasks, such as clustering and outlier detection in large multidimensional datasets. In densitybiased sampling, the probability that a given point will be included in the sample depends on the local density of the dataset. We propose a general technique for density-...

متن کامل

Monetization Strategies for the Web of Data

Inspired by the World Wide Web, the Web of Data is a network of interlinked data fragments. One of the main advantages of the Web of Data is that all of its content is processable by machines. However, this also has its drawbacks when it comes to monetization of the content: advertisements and donations—two important financial motors in the World Wide Web—do not translate into the Web of Data a...

متن کامل

An Approximation Scheme for Planar Graph TSP

We consider the special case of the traveling salesman problem (TSP) in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial-time approximation scheme (PTAS) for this problem.

متن کامل

An Approximation Scheme for Terrain Guarding

We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algorithm inspired by the recent results of Chan and Har-Peled [2] and Mustafa and Ray [15]. Our key contribution is to show the existence of a planar graph that appropriately relates the local and global optimum.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Social Science Research Network

سال: 2021

ISSN: ['1556-5068']

DOI: https://doi.org/10.2139/ssrn.3808875